Recursive Functions For Computation Of Natural Secret Languages
نویسنده
چکیده
The paper d e s c r i b e s a sys tem c a l l e d RENTTU, a c o l l e c t i o n o f f u n c t i o n s f o r c o m p u t a t i o n o f t r a n s f o r m a t i o n s from n a t u r a l l a n g u a g e s i n t o s e v e r a l types o f n a t u r a l s e c r e t l anguages such as P i g L a t i n e t c . By a n a t u r a l s e c r e t l a n g u a g e , somet imes c a l l e d can t i n E n g l i s h o r c h i l d r e n ' s p l a y l anguage we mean s n a t u r a l l anguage t r a n s f o r m a t i o n , which p r e s e r v e s i m p o r t a n t morphoand p h o n o l o g i c a l q u a l i t i e s o f the u n d e r l y i n g sou rce l a n g u a g e . Such l a n g u a g e s seem to make up a r i c h c u l t u r e , which i s a m i x t u r e o f l o r e , l i n g u i s t i c s , c r y p t o l o g y , and i f you wish o f comput ing .
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملUsing program structure to guide optimization in the presence of first-class functions
Compilers for functional languages such as Standard ML can do a good job compiling programs, especially programs that perform symbolic computation. However, they often do a poor job on programs in a wide range of real-world application domains, such as systems programming and scientific computing. One reason for this is that these compilers are not sensitive to program structure, that is, recur...
متن کاملGame-theoretic Model of Computation
The present paper introduces an intrinsic notion of “(effective) computability” in game semantics motivated by the fact that strategies in game semantics have been defined recursive if they are “computable in an extrinsic sense”, i.e., they are representable by partial recursive functions, and so it has been difficult to regard game semantics as an autonomous foundation of computation. As a con...
متن کاملTHE a - UNION THEOREM AND GENERALIZED PRIMITIVE RECURSION
A generalization to a-recursion theory of the McCreight-Meyer Union Theorem is proved. Theorem. Let <5> be an a-computational complexity measure and {ft\e < a) an a-r.e. strictly increasing sequence of a-recursive functions. Then there exists an a-recursive function k such that C* ~ U «<aC/f • The proof entails a no-injury cancellation atop a finite-injury priority construction and necessitates...
متن کاملRecursive Information Hiding in Visual Cryptography
Visual Cryptography is a secret sharing scheme that uses the human visual system to perform computations. This paper presents a recursive hiding scheme for 3 out of 5 secret sharing. The idea used is to hide smaller secrets in the shares of a larger secret without an expansion in the size of the latter.
متن کاملA Domain-theoretic Ap roach to Integrating Functional and Logic ii atabase Languages
The advantages of logic languages with respect to search-based computation are well-understood, while the advantages of functional languages with respect to dcterministic computation are becoming increasingly rccognised. It is therefore natural to investigate the dcvelopment of languages which reconcile the two paradigms. As a contribution to this effort, we extend an existing functional databa...
متن کامل